Optimal 1-NN prototypes for pathological geometries
نویسندگان
چکیده
منابع مشابه
Optimal Array Geometries for Wideband DOA Estimation
We consider the role of array geometry on the Direction of Arrival (DOA) estimating performance of the array where the impinging signal is wideband. We concentrate on arrays that have isotropic performance. An isotropic array is one whose Cramér Rao bound (CRB) on the DOA of a single source is uniform for all angles. We derive the necessary and sufficient conditions on the location of array ele...
متن کاملDesign Guidelines for Optimal Results in FPGAs and ASIC Prototypes
Design practices have an enormous impact on an FPGA design’s timing performance, logic utilization, and system reliability. Good design practices also aid in successful design migration between FPGA and ASIC implementations for both prototyping and production. Poor design practices can lead to low performance, high logic or resource utilization, and unstable or unreliable designs associated wit...
متن کاملOptimal rates for k-NN density and mode estimation
We present two related contributions of independent interest: (1) high-probability finite sample rates for k-NN density estimation, and (2) practical mode estimators – based on k-NN – which attain minimax-optimal rates under surprisingly general distributional conditions.
متن کاملOptimal Shaping of Non-Conventional Permanent Magnet Geometries for Synchronous Motors via Surrogate Modeling and Multi-Objective Optimization Approach
A methodology is proposed for optimal shaping of permanent magnets with non-conventional and complex geometries, used in synchronous motors. The algorithm includes artificial neural network-based surrogate model and multi-objective search based optimization method that will lead to Pareto front solutions. An interior permanent magnet topology with crescent-shaped magnets is also introduced as t...
متن کامل∗ k - geometries Antonio Pasini 1
The classification of finite flag-transitive linear spaces, obtained by Buekenhout, Delandtsheer, Doyen, Kleidman, Liebeck and Saxl [20] at the end of the eighties, gave new impulse to the program of classifying various classes of locally finite flag-transitive geometries belonging to diagrams obtained from a Coxeter diagram by putting a label L or L∗ on some (possibly, all) of the single-bond ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PeerJ Computer Science
سال: 2021
ISSN: 2376-5992
DOI: 10.7717/peerj-cs.464